A system which can define its own truth
نویسندگان
چکیده
منابع مشابه
One Useful Logic That Defines Its Own Truth
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use...
متن کاملThe Truth System: Can a System of Lying Processes Stabilize?
We introduce a new abstract system, called the truth system. In the truth system, a process deduces a true value, with high probability, from an incoming stream of both true and false values, where the probability that a value in the incoming stream is true is at least 0.6. At each instant, the receiving process maintains at most one candidate of the true value, and eventually the process reach...
متن کاملAn Efficient Robot Planner which Generates Its Own Procedures
LAWALY is a LISP program which solves robot planning problems. Given an axiomatic description of its capabilities in sorne world, she generates her own procedures to embody these capabilities. She executes these procedures to solve specific tasks in the world. Hierarchies of subtasks guide the search for a solution. In sufficiently large worlds, LAWALY has routinely solved tasks requiring sever...
متن کاملSystems Developers Define their Own Information Needs
Access to the right information is a significant contributor to success in many endeavors. It is, however, difficult to characterize what constitutes right information. This is an important question for systems development projects, which continue to exhibit a sub-par track record of success. This paper describes patterns of information seeking such as nature of information sought and sources o...
متن کاملRadicals which define factorization systems
A method due to Fay and Walls for associating a factorization system with a radical is examined for associative rings. It is shown that a factorization system results if and only if the radical is strict and supernilpotent. For groups and non-associative rings, no radical defines a factorization system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1950
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-37-1-190-192